Towards a Truly Concurrent Semantics for Reversible CCS
نویسندگان
چکیده
Reversible CCS (RCCS) is a well-established, formal model for reversible communicating systems, which has been built on top of the classical Calculus Communicating Systems (CCS). In its original formulation, each process equipped with memory that records performed actions, then used to reverse computations. More recently, abstract models RCCS have proposed in literature, basically, by directly associating processes (reversible versions of) event structures. this paper we propose detour: starting from one well-known encoding into Petri nets apply recently approach incorporate causally-consistent reversibility nets, obtaining as result (reversible) net counterpart every term.
منابع مشابه
A Truly Concurrent Semantics for a Simple Parallel Programming Language
This paper gives the first truly concurrent denotational, i.e., compositional semantics for a simple, deterministic parallel language. By truly concurrent we mean the denotational model does not rely on an interleaving of concurrent actions for its definition. Thus, our semantics does not reduce parallelism to nondeterminism, as is done in the more established approaches to concurrency. We also...
متن کاملTowards a Semantics for Concurrent METATEM
Concurrent METATEM is a programming language based on the notion of concurrent, communicating objects, where each object directly executes a specification given in temporal logic, and communicates with other objects using asynchronous broadcast message-passing. Thus, Concurrent METATEM represents a combination of the direct execution of temporal specifications, together with a novel model of co...
متن کاملA Partial Ordering Semantics for CCS
A new operatilcrnql semantics for *‘pure” CCS is proposed that considers the parallel operator as a first class one, and permits a description of the calculus in terms of partial orderings. The new semantics (also for unguarded agents) is given in the SOS style via the partial ordering derivation relation. CCS agenis are decomposed into sets of sequential subagents. The new derivations relate s...
متن کاملA truly concurrent semantics for a process algebra using resource pomsets
In this paper we study a process algebra whose semantics is based on true concurrency. In our model, actions are defined in terms of the resources they need to execute, which allows a simple definition of a weak sequential composition operator. This operator allows actions which do not share any resources to execute concurrently, while dependent actions have to occur sequentially. This weak seq...
متن کاملTowards a Denotational Semantics for Concurrent State Transformers
Concurrent state transformers are an extension of state transformers investigated by Launchbury, Peyton Jones, Wadler, and others by concurrency primitives. A denotational semantics for state transformers executing in parallel is deened using standard domain theoretic techniques. Using the semantics it is proved that concurrent state transformers still form a monad and that the concurrent seman...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-79837-6_7